A study of different metaheuristics to solve the urban transit crew scheduling problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Approaches in Metaheuristics to Solve the Truck Scheduling Problem in a Cross-docking Center

Nowadays, cross-docking is one of the main concepts in supply chain management in which products received to a distribution center by inbound trucks which are directly to lead into outbound trucks with a minimum handling and storage costs as the main cost of a cross-docking system. According to the literature, several metaheuristics and heuristics are attempted to solve this optimization model....

متن کامل

Combining Metaheuristics and Constraint Programming to Solve a Scheduling Problem

In this paper we present a hybrid method, named Quasi Local Search, which combines Simulated Annealing augmented with a type of Tabu List to guide the search globally with Constraint Programming to search locally the optimal solution. The method can also be seen as an integration framework, once the Local Search module is independent of the Constraint Programming one and either can be worked in...

متن کامل

Multiobjective Genetic Algorithm to Solve the Train Crew Scheduling Problem

-This paper presents a multiobjective genetic algorithm (MOGA)to solve the train crew pairing problem in railway companies. The proposed MOGA has several features, such as 1) A permutation-based model is proposed rather than the 0-1 set partition model. 2) Instead of pre-assigning a fixed group number of crewmembers, the proposed method can determine it by performing the evolutionary process. 3...

متن کامل

Assesing The Performance of Different S-Metaheuristics To Solve Unrestricted Parallel Identical Machines Scheduling Problem

In this paper we present a comparative study of four trajectory or single-solution based metaheuristics (S-metaheuristics): Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP), Variable Neighborhood Search (VNS), and Simulated Annealing (SA). These metaheuristics were considered to assess their respective performance to minimize the Maximum Tardiness (Tmax) for the ...

متن کامل

from linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar

chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Transport Literature

سال: 2014

ISSN: 2238-1031

DOI: 10.1590/2238-1031.jtl.v8n4a9